Approximations in Distributed Optimization
نویسندگان
چکیده
We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. For exact computation, the size of the largest message is exponential in the width of the constraint graph. We present a distributed approximation scheme where the size of the largest message can be adapted to the desired approximation ratio. The process is similar to a distributed version of the minibucket elimination scheme, performed on a DFS traversal of the problem. The second part of this paper presents an anytime version of the algorithm. It provides increasingly accurate solutions while the propagation is still in progress. This makes it suitable for very large, distributed problems, where the propagation may take too long to complete. Simulation results show that these algorithms are a viable approach to real world, loose optimization problems, possibly of unbounded size.
منابع مشابه
An algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملParallelism with limited nondeterminism
Since parallel computing is again becoming a topic of interest in computer science, it is important to revisit the theoretical foundations of highly parallel computing. “Inherently sequential” computational problems see no significant speedup when run on highly parallel computers. Just as there are efficient approximations for intractable optimization problems, so too are there efficient and hi...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملRevisiting the Auto-Regressive Functions of the Cross-Entropy Ant System
The Cross-Entropy Ant System (CEAS) is an Ant Colony Optimization (ACO) system for distributed and online path management in telecommunication networks. Previous works on CEAS have enhanced the system by introducing new features. This paper takes a step back and revisits the auto-regressive functions at the core of the system. These functions are approximations of complicated transcendental fun...
متن کاملRobust optimization of distributed parameter systems
In this paper, we will discuss the use of new methods from robust control and especially H°° theory for the explicit construction optimal feedback compensators for several practical distributed parameter systems. Indeed, based on operator and interpolation theoretic methods one can now solve the standard H control problem for a broad class of systems modelled by PDEs. In our approach, the compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005